There is no EPTAS for two-dimensional knapsack
نویسندگان
چکیده
منابع مشابه
There is no EPTAS for two-dimensional knapsack
In the d-dimensional knapsack problem given is a set of items, each having a d-dimensional size vector and a profit, and a d-dimensional bin. The goal is to select a subset of the items of maximum total profit such that the sum of all vectors is bounded by the bin capacity in each dimension. It is well known that, unless P = NP , there is no fully polynomial time approximation scheme for d-dime...
متن کاملThere is no Asymptotic PTAS for Two-Dimensional Vector Packing
The d-dimensional vector packing problem is a well-known generalization of the classical bin packing problem: For a given list of vectors in [ 0, 1 ] d, the goal is to partition the list into the minimum number of subsets, such that in every subset the sum of all vectors is at most one in every coordinate. For the case d = 1, Femandez de la Vega and Lueker ( 1981) designed an asymptotic polynom...
متن کاملConsensus Patterns (Probably) Has no EPTAS
Given n length-L strings S = {s1, . . . , sn} over a constant size alphabet Σ together with an integer `, where ` ≤ L, the objective of Consensus Patterns is to find a length-` string s, a substring ti of each si in S such that ∑ ∀i d(ti, s) is minimized. Here d(x, y) denotes the Hamming distance between the two strings x and y. Consensus Patterns admits a PTAS [Li et al., JCSS 2002] is fixed p...
متن کاملThere is no lexicon!
0. Introduction Within generative linguistics, underlying representations have been a sine qua non. Such representations have been thought to encode what is unpredictable or not governed by rules. Within Optimality Theory (henceforth OT), even though the rules are virtually gone, this view continues. The function GEN and EVAL pair an underlying representation with an optimal output. I argue aga...
متن کاملOn Two Dimensional Orthogonal Knapsack Problem
In this paper, we study the following knapsack problem: Given a list of squares with profits, we are requested to pack a sublist of them into a rectangular bin (not a unit square bin) to make profits in the bin as large as possible. We first observe there is a Polynomial Time Approximation Scheme (PTAS) for the problem of packing weighted squares into rectangular bins with large resources, then...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2010
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.05.031